Non-Quadratic Optimization and Adaptive Robust Filtering
نویسندگان
چکیده
منابع مشابه
Robust Quadratic Programming for Price Optimization
The goal of price optimization is to maximize total revenue by adjusting the prices of products, on the basis of predicted sales numbers that are functions of pricing strategies. Recent advances in demand modeling using machine learning raise a new challenge in price optimization, i.e., how to manage statistical errors in estimation. In this paper, we show that uncertainty in recently-proposed ...
متن کاملRobust Optimization of Unconstrained Binary Quadratic Problems
In this paper we focus on the unconstrained binary quadratic optimization model, maximize xQx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, pa...
متن کاملGeneralized Correntropy for Robust Adaptive Filtering
1. Institute of Artificial Intelligence and Robotics, Xi'an Jiaotong University, Xi'an, 710049, China 2. School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China 3. Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL 32611 USA Abstract—As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attent...
متن کاملNon-causal adaptive IIR filtering
A procedure to approximate non-causal adaptive IIR filtering is described. Such structures could be useful, for instance, in the equalization of non-minimum phase communication channels. The procedure is based on backward calculations within blocks of samples and we show that for adaptive filtering the overlap-save method is more suitable than the overlap-add method. Moreover, a temporary freez...
متن کاملGeometric Optimization Methods for Adaptive Filtering
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and adaptive control. A new point of view is offered for the constrained optimization problem. Some classical optimization techniques on Euclidean space are generalize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.11.481